branch programming
英 [brɑːntʃ ˈprəʊɡræmɪŋ]
美 [bræntʃ ˈproʊɡræmɪŋ]
【计】分支程序设计
双语例句
- Being an important branch of genetic algorithm, genetic programming ( GP) is an unitary approach to providing computer programs that find problem solutions.
遗传规划（GP）是遗传算法的一个重要分支，是提供找到解决问题的计算机程序的统一途径。 - In order to improve the computational efficiency, a branch algorithm for general integer linear programming problems on the objective function hyperplane shifts was presented.
为了提高求解一般整数线性规划问题的效率，提出了一种基于目标函数超平面移动的分支算法。 - A reduced branch and bound approach for solving quadratic programming problem with quadratic constraints;
提出了一种结构计算模型修正的二次约束最小二乘方法。 - To Classify the Conic Section with Primary Alternation; A branch and bound algorithm for a kind of indefinite quadratic programming
浅谈用初等变换对二次曲线进行分类一类不定二次规划问题的分枝定界法 - A branch and bound algorithm for a kind of indefinite quadratic programming
一类不定二次规划问题的分枝定界法 - Opinion On the Limit Types of the "Disadvantaged" University Students A branch and bound algorithm for a kind of indefinite quadratic programming
高校弱势学生群体界定分类研究刍议一类不定二次规划问题的分枝定界法 - A Branch-and-Bound Method of Geometric Programming Problems
几何规划问题的一种分枝定界方法 - Gaol programming, a branch of programming theory in operations re-search, is applied to deal with problems in management planning for construction con-ducting enterprise.
用运筹学中规划论的一个分支&目标规划来解决施工企业经营计划的问题。 - And at the same time, the author in practice, promotes the usage of several methods, such as backtracking method, branch and bound method, greedy method and dynamic programming, to specifically solve the mapping and its order processing problems.
并且结合实例，提出了回溯法、分支限界法、贪婪算法、动态规划等方法的具体解决思路及其排序过程。 - The paper presents a branch and reduce approach for solving nonconvex quadratic programming problems with quadratic constraints, which organically combines outer approximation method with branch and bound scheme.
在这篇论文里，有机地把外逼近方法与分枝定界技术结合起来，提出了解带有二次约束非凸二次规划问题的一个分枝缩减方法； - The operational procedure and the program controlled principle of the experimental installation for FCC slurry oil filtration system of the second FCCU in Sinopec Jiujiang Branch Corporation are introduced; it adopts programming CL/ HPM of TDC 3000 system to realize automatic control for the installation.
介绍了中国石化股份公司九江分公司Ⅱ套催化油浆过滤试验装置的工艺原理和程序化控制原理，采用系统的CL/HPM编程方式实现该装置自动控制的方法。 - At last, the Branch and Bound method of Integer Linear Programming is employed, which made the above non-integer solutions as initial ones.
最后，利用整数线性规划法中的分支定界法，以非整数解作为起始解，得到了整数解的低码率码组。 - In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。 - In this paper, a model for productive managing planning in factory is constructed and is solved by the simplex method with the branch and bound method of goal programming.
本文用混合整数目标规划建立了工厂（企业）的生产（经营）计划模型，并将目标单纯形法和分枝定界法相结合给出了一个算法。 - The multiple location optimal model is solved by the method which is called location, distribution by turns. Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years.
近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。 - The model uses branch activity analysis, econometric analysis and linear programming.
该模型采用了部门活动水平分析、计量经济分析和线性规划分析方法，可应用于温室气体减排技术选择和减排对经济影响分析。 - The model and computer method proposed in this paper satisfy such a requirment because of the application of concentric relaxation, recursive branch constraint treatment in linear programming and a direct method for B-1 matrix modification.
本文的模型和算法，由于利用了同心松弛概念和逐次处理约束条件的思想，以及应用修正节点电纳矩阵反演求逆的方法，适应了这种需要。 - In this paper, the authors modify the optimization model of rotation irrigation branch canal distribution in 0-1 linear integral programming. Using genetic algorithm, the model is solved.
该文改进了“定流量，变历时”渠道运行方式的轮灌配水优化模型，应用遗传算法进行了配水渠道流量优化的0&1整数规划模型求解。 - The blocking flow theory is a new branch of network flow programming to study the blockage phenomenon of uncertainty and multiple values.
堵塞流理论就是研究网络流规划中不确定性和多值性现象的新领域。 - A Discussion on the branch-and-bound Approach to Linear Bilevel Programming
关于线性二层规划分枝定界方法的探讨 - Off line programming has become an important branch in robotic programming because it has many advantages such as wide applicability and not occupying production time.
离线编程因其不占用生产时间、适用性广等优点，已成为机器人编程中的重要的一个分支。 - As a theoretical branch of NLP ( Neuro-linguistic programming), Internal Representational Systems in the current teaching practice application is a relatively new topic.
内感官理论作为NLP（Neuro-linguisticprogramming，身心语法程序学）的一个理论分支，在当前课堂教学实践中的运用是一个比较新鲜的课题。 - A three-phase state estimation algorithm based on the branch current for distribution network is realized by practical programming using Java.
对于基于支路电流的配电网三相状态估计算法，采用Java语言编制了相应的应用程序。 - After Land and Doig put forward the branch and bound algorithm for solving mixed integer programming problem, the research on algorithm that used to solve mixed integer programming problem have made a big progress.
自Land和Doig等人提出求解整数规划问题的分枝定界法以来，混合整数规划的求解方法得到了很大的发展。 - According to the principle of branch and bound algorithm for linear integer programming and the Lemke algorithm for quadratic programming, this thesis shows a branch and bound algorithm and a program of the algorithm with the Matlab programming language for solving the model.
根据线性整数规划的分枝定界算法和二次规划的Lemke算法的原理，给出该模型求解的分枝定界算法，并编写了该算法的Matlab程序。 - The objective of this research is to present new approaches for improving the performance of distance algorithm by use of some existing technologies such as sweeping line, bounding volume hiberarchy, branch limit strategy, heuristic searching and nonlinear programming theory.
本论文研究的目的是将扫描线技术、包围体层次树、分支限界策略、启发式搜索算法和非线性规划理论等应用到本课题的研究中，寻求本课题一些关键问题的快速和有效的解决方法。 - Methods which solve the SBH problem are exact algorithms ( branch and bound algorithm, dynamic programming method, etc.) and heuristic methods ( tabu search algorithm, genetic algorithm, ant colony algorithm, simulated annealing algorithm, etc.).
求解杂交测序问题主要有精确算法（分支定界算法，动态规划方法等）和启发式搜索方法（禁忌搜索算法，遗传算法，蚁群算法，模拟退火算法等）两类。 - A branch of mathematical programming. Study of more than one objective function in a given area on the optimization.
数学规划[1]的一个分支，研究多于一个目标函数在给定区域上的最优化，又称多目标最优化。 - However, because a large number of branch instructions were used in programming, and for the uncertainty implementation behavior, each branch instruction tends to bring a halt to wait for the process results, which seriously affected the implementation efficiency of processors.
但是，由于程序设计中普遍使用的分支指令存在着执行行为的不确定性，处理器往往会因整条流水线停顿等待分支指令的执行结果，从而降低处理器执行效率。 - Robust optimization ( RO) is a relatively recent technique as a new branch of math programming, and it is a powerful methodology used to solve uncertain program problems.
鲁棒优化（RO）作为数学规划的一个新分支近几年才发展起来，它是解决不确定规划问题的一种强有力工具。